Tightness of Fluctuations of First Passage Percolation on Some Large Graphs
نویسندگان
چکیده
The theorem of Dekking and Host [6] regarding tightness around the mean of first passage percolation on the binary tree, from the root to a boundary of a ball, is generalized to a class of graphs which includes all lattices in hyperbolic spaces and the lamplighter graph over N. This class of graphs is closed under product with any bounded degree graph. Few open problems and conjectures are gathered at the end.
منابع مشابه
Speeding up non-Markovian First Passage Percolation with a few extra edges
One model of real-life spreading processes is First Passage Percolation (also called SI model) on random graphs. Social interactions often follow bursty patterns, which are usually modelled with i.i.d. heavy-tailed passage times on edges. On the other hand, random graphs are often locally tree-like, and spreading on trees with leaves might be very slow, because of bottleneck edges with huge pas...
متن کاملFirst passage percolation on a hyperbolic graph admits bi-infinite geodesics*
Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges. An open question attributed to Furstenberg ([14]) is whether there exists a bi-infinite geodesic in first passage percolation on the euclidean lattice of dimension at least 2. Although the answer is generally conjectured to be negative, we give a positive answer for graphs sa...
متن کاملThe front of the epidemic spread and first passage percolation
In this paper we establish a connection between epidemic models on random networks with general infection times considered in [2] and first passage percolation. Using techniques developed in [6], when each vertex has infinite contagious periods, we extend results on the epidemic curve in [2] from bounded degree graphs to general sparse random graphs with degrees having finite third moments as n...
متن کاملThe divergence of fluctuations for the shape on first passage percolation
Consider the first passage percolation model on Zd for d ≥ 2. In this model we assign independently to each edge the value zero with probability p and the value one with probability 1− p. We denote by T (0, v) the passage time from the origin to v for v ∈ Rd and B(t) = {v ∈ R : T (0, v) ≤ t} and G(t) = {v ∈ R : ET (0, v) ≤ t}. It is well known that if p < pc, there exists a compact shape Bd ⊂ R...
متن کاملFirst-passage percolation on random geometric graphs and an application to shortest-path trees
We consider Euclidean first-passage percolation on a large family of connected random geometric graphs in the d-dimensional Euclidean space encompassing various well-known models from stochastic geometry. In particular, we establish a strong linear growth property for shortest-path lengths on random geometric graphs which are generated by point processes. We consider the event that the growth o...
متن کامل